A combinatorial Schur expansion of triangle-free horizontal-strip LLT polynomials

نویسندگان

چکیده

In recent years, Alexandersson and others proved combinatorial formulas for the Schur function expansion of horizontal-strip LLT polynomial \(G_{\boldsymbol\lambda}(\boldsymbol x;q)\) in some special cases. We associate a weighted graph \(\Pi\) to \(\boldsymbol\lambda\) we use it express linear relation among polynomials. apply this prove an explicit Schur-positive whenever is triangle-free. also that largest power \(q\) total edge weight our graph.Keywords: Charge, chromatic symmetric function, cocharge, Hall--Littlewood polynomial, jeu de taquin, interval graph, Schur-positive, function.Mathematics Subject Classifications: 05E05, 05E10, 05C15

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Schur Expansion of Macdonald Polynomials

Building on Haglund’s combinatorial formula for the transformed Macdonald polynomials, we provide a purely combinatorial proof of Macdonald positivity using dual equivalence graphs and give a combinatorial formula for the coefficients in the Schur expansion.

متن کامل

Triangle Strip Compression

In this paper we introduce a simple and efficient scheme for encoding the connectivity and the stripification of a triangle mesh. Since generating a good set of triangle strips is a hard problem, it is desirable to do this just once and store the computed strips with the triangle mesh. However, no previously reported mesh encoding scheme is designed to include triangle strip information into th...

متن کامل

Synopsis: Dual Equivalence Graphs, Ribbon Tableaux and Macdonald Polynomials

The primary focus of this dissertation is symmetric function theory. The main objectives are to present a new combinatorial construction which may be used to establish the symmetry and Schur positivity of a function expressed in terms of monomials, and to use this method to find a combinatorial description of the Schur expansion for two important classes of symmetric functions, namely LLT and M...

متن کامل

A Combinatorial Proof of a Weyl Type Formula for Hook Schur Polynomials

In this paper, we present a simple combinatorial proof of a Weyl type formula for hook Schur polynomials, which has been obtained by using a Kostant type cohomology formula for glm|n. In general, we can obtain in a combinatorial way a Weyl type formula for various highest weight representations of a Lie superalgebra, which together with a general linear algebra forms a Howe dual pair.

متن کامل

Complexity of tropical Schur polynomials

We study the complexity of computation of a tropical Schur polynomial Tsλ where λ is a partition, and of a tropical polynomial Tmλ obtained by the tropicalization of the monomial symmetric function mλ. Then Tsλ and Tmλ coincide as tropical functions (so, as convex piece-wise linear functions), while differ as tropical polynomials. We prove the following bounds on the complexity of computing ove...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Combinatorial theory

سال: 2021

ISSN: ['2766-1334']

DOI: https://doi.org/10.5070/c61055380